An L Theory of Sparse Graph Convergence I: Limits, Sparse Random Graph Models, and Power Law Distributions
نویسندگان
چکیده
We introduce and develop a theory of limits for sequences of sparse graphs based on Lp graphons, which generalizes both the existing L∞ theory of dense graph limits and its extension by Bollobás and Riordan to sparse graphs without dense spots. In doing so, we replace the no dense spots hypothesis with weaker assumptions, which allow us to analyze graphs with power law degree distributions. This gives the first broadly applicable limit theory for sparse graphs with unbounded average degrees. In this paper, we lay the foundations of the Lp theory of graphons, characterize convergence, and develop corresponding random graph models, while we prove the equivalence of several alternative metrics in a companion paper.
منابع مشابه
An L Theory of Sparse Graph Convergence Ii: Ld Convergence, Quotients, and Right Convergence
We extend the Lp theory of sparse graph limits, which was introduced in a companion paper, by analyzing different notions of convergence. Under suitable restrictions on node weights, we prove the equivalence of metric convergence, quotient convergence, microcanonical ground state energy convergence, microcanonical free energy convergence, and large deviation convergence. Our theorems extend the...
متن کاملFace Recognition using an Affine Sparse Coding approach
Sparse coding is an unsupervised method which learns a set of over-complete bases to represent data such as image and video. Sparse coding has increasing attraction for image classification applications in recent years. But in the cases where we have some similar images from different classes, such as face recognition applications, different images may be classified into the same class, and hen...
متن کاملEmpirical Spectral Distributions of Sparse Random Graphs
We study the spectrum of a random multigraph with a degree sequence Dn = (Di) n i=1 and average degree 1 ωn n, generated by the configuration model. We show that, when the empirical spectral distribution (esd) of ω−1 n Dn converges weakly to a limit ν, under mild moment assumptions (e.g., Di/ωn are i.i.d. with a finite second moment), the esd of the normalized adjacency matrix converges in prob...
متن کاملSpectrum of Markov generators on sparse random graphs
We investigate the spectrum of the infinitesimal generator of the continuous time random walk on a randomly weighted oriented graph. This is the non-Hermitian random n× n matrix L defined by Ljk = Xjk if k 6= j and Ljj = − ∑ k 6=j Ljk , where (Xjk)j 6=k are i.i.d. random weights. Under mild assumptions on the law of the weights, we establish convergence as n → ∞ of the empirical spectral distri...
متن کاملEuclidean vs Graph Metric
The theory of sparse graph limits concerns itself with versions of local convergence and global convergence, see e.g. [41]. Informally, in local convergence we look at a large neighborhood around a random uniformly chosen vertex in a graph and in global convergence we observe the whole graph from afar. In this note rather than surveying the general theory we will consider some concrete examples...
متن کامل